Improved decoding of woven convolutional codes via hierarchical near-EEP code structure

نویسندگان

  • Simon Huettinger
  • Johannes B. Huber
چکیده

A hierarchically designed channel coding scheme protects a few number of input data streams so–called layers with decreasing amount of redundancy from layer 0 to layer L. Such a code design clearly leads to unequal error protection, but as shown in [9] it can be superior in the average bit error rate compared to an equal error protection (EEP) design, if the protection of layers is not too different. This is due to the fact, that a near–EEP hierarchical design can match the properties of the iterative decoder. In this paper we extend the result to Woven Convolutional Codes (WCC) [8]. Based on asymptotical analysis of the convergence of iterative decoding by means of EXIT charts [4] we show that for infinite interleaver size the hierarchical structure is superior. Furthermore, we show that even for practical block sizes used in modern communication systems a significant improvement is possible by hierarchical design.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the error exponent for woven convolutional codes with inner warp

In this correspondence the error exponent and the decoding complexity of binary woven convolutional codes with outer warp and with binary convolutional codes as outer and inner codes are studied. It is shown that an error probability that is exponentially decreasing with the product of the outer and inner code memories can be achieved with a nonexponentially increasing decoding complexity.

متن کامل

Woven convolutional graph codes with large free distances

Constructions of woven graph codes based on constituent convolutional codes are studied, and examples of woven convolutional graph codes are presented. Existence of codes satisfying the Costello lower bound on the free distance within a random ensemble of woven graph codes based on s-partite, s-uniform hypergraphs is shown, where s depends only on the code rate. Simulation results for Viterbi d...

متن کامل

Pipeline Decoding of Woven Convolutional Codes

A pipeline decoder for woven convolutional codes (WCCs) is introduced. The decoding is performed iteratively by shifting a window over the received sequence. For the symbol–by–symbol a posteriori (s/s– APP) decoding of convolutional code segments, a windowed version of the BCJR algorithm is applied. This pipeline concept allows a trade–off between decoding delay, decoding complexity, and perfor...

متن کامل

Woven codes with outer warp: variations, design, and distance properties

In this paper we consider convolutional and block encoding schemes which are variations of woven codes with outer warp. We propose methods to evaluate the distance characteristics of the considered codes on the basis of the active distances of the component codes. With this analytical bounding technique, we derived lower bounds on the minimum (or free) distance of woven convolutional codes, wov...

متن کامل

Multitree search decoding of linear codes

Tree search algorithms have a long history in computer science. In the coding literature, tree search algorithms have traditionally been used for decoding convolutional codes. Convolutional codes are linear codes with a special structure. Classic tree search decoders (most notably the sequential decoder) search one code tree in which the bits are ordered sequentially. We propose a multitree sea...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001